Structural graph matching using the EM algorithm and singular value decomposition

This paper describes an efficient algorithm for inexact graph matching. The method is purely structural, that is, it uses only the edge or connectivity structure of the graph and does not draw on node or edge attributes. We make two contributions: 1) commencing from a probability distribution for matching errors, we show how the problem of graph matching can be posed as maximum-likelihood estimation using the apparatus of the EM algorithm; and 2) we cast the recovery of correspondence matches between the graph nodes in a matrix framework. This allows one to efficiently recover correspondence matches using the singular value decomposition. We experiment with the method on both real-world and synthetic data. Here, we demonstrate that the method offers comparable performance to more computationally demanding method

Shape from periodic texture using the eigenvectors of local affine distortion

This paper shows how the local slant and tilt angles of regularly textured curved surfaces can be estimated directly, without the need for iterative numerical optimization, We work in the frequency domain and measure texture distortion using the affine distortion of the pattern of spectral peaks. The key theoretical contribution is to show that the directions of the eigenvectors of the affine distortion matrices can be used to estimate local slant and tilt angles of tangent planes to curved surfaces. In particular, the leading eigenvector points in the tilt direction. Although not as geometrically transparent, the direction of the second eigenvector can be used to estimate the slant direction. The required affine distortion matrices are computed using the correspondences between spectral peaks, established on the basis of their energy ordering. We apply the method to a variety of real-world and synthetic imagery

Recovery of surface orientation from diffuse polarization

When unpolarized light is reflected from a smooth dielectric surface, it becomes partially polarized. This is due to the orientation of dipoles induced in the reflecting medium and applies to both specular and diffuse reflection. This paper is concerned with exploiting polarization by surface reflection, using images of smooth dielectric objects, to recover surface normals and, hence, height. This paper presents the underlying physics of polarization by reflection, starting with the Fresnel equations. These equations are used to interpret images taken with a linear polarizer and digital camera, revealing the shape of the objects. Experimental results are presented that illustrate that the technique is accurate near object limbs, as the theory predicts, with less precise, but still useful, results elsewhere. A detailed analysis of the accuracy of the technique for a variety of materials is presented. A method for estimating refractive indices using a laser and linear polarizer is also given

Correcting curvature-density effects in the Hamilton-Jacobi skeleton

The Hainilton-Jacobi approach has proven to be a powerful and elegant method for extracting the skeleton of two-dimensional (2-D) shapes. The approach is based on the observation that the normalized flux associated with the inward evolution of the object boundary at nonskeletal points tends to zero as the size of the integration area tends to zero, while the flux is negative at the locations of skeletal points. Nonetheless, the error in calculating the flux on the image lattice is both limited by the pixel resolution and also proportional to the curvature of the boundary evolution front and, hence, unbounded near endpoints. This makes the exact location of endpoints difficult and renders the performance of the skeleton extraction algorithm dependent on a threshold parameter. This problem can be overcome by using interpolation techniques to calculate the flux with subpixel precision. However, here, we develop a method for 2-D skeleton extraction that circumvents the problem by eliminating the curvature contribution to the error. This is done by taking into account variations of density due to boundary curvature. This yields a skeletonization algorithm that gives both better localization and less susceptibility to boundary noise and parameter choice than the Hamilton-Jacobi method

Graph matching with a dual-step EM algorithm

This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifying point-correspondence matches. Unification is realized by constructing a mixture model over the bipartite graph representing the correspondence match and by affecting optimization using the EM algorithm. According to our EM framework, the probabilities of structural correspondence gate contributions to the expected likelihood function used to estimate maximum likelihood transformation parameters. These gating probabilities measure the consistency of the matched neighborhoods in the graphs. The recovery of transformational geometry and hard correspondence matches are interleaved and are realized by applying coupled update operations to the expected log-likelihood function. In this way, the two processes bootstrap one another. This provides a means of rejecting structural outliers. We evaluate the technique on two real-world problems. The first involves the matching of different perspective views of 3.5-inch floppy discs. The second example is furnished by the matching of a digital map against aerial images that are subject to severe barrel distortion due to a line-scan sampling process. We complement these experiments with a sensitivity study based on synthetic data

A study of pattern recovery in recurrent correlation associative memories

In this paper, we analyze the recurrent correlation associative memory (RCAM) model of Chiueh and Goodman. This is an associative memory in which stored binary memory patterns are recalled via an iterative update rule. The update of the individual pattern-bits is controlled by an excitation function, which takes as its arguement the inner product between the stored memory patterns and the input patterns. Our contribution is to analyze the dynamics of pattern recall when the input patterns are corrupted by noise of a relatively unrestricted class. We make three contributions. First, we show how to identify the excitation function which maximizes the separation (the Fisher discriminant) between the uncorrupted realization of the noisy input pattern and the remaining patterns residing in the memory. Moreover, we show that the excitation function which gives maximum separation is exponential when the input bit-errors follow a binomial distribution. Our second contribution is to develop an expression for the expectation value of bit-error probability on the input pattern after one iteration. We show how to identify the excitation function which minimizes the bit-error probability. However, there is no closed-form solution and the excitation function must be recovered numerically. The relationship between the excitation functions which result from the two different approaches is examined for a binomial distribution of bit-errors. The final contribution is to develop a semiempirical approach to the modeling of the dynamics of the RCAM. This provides us with a numerical means of predicting the recall error rate of the memory. It also allows us to develop an expression for the storage capacity for a given recall error rate

Bayesian graph edit distance

This paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matching by Sanfeliu and Fu [1]. We show how the Levenshtein distance can be used to model the probability distribution for structural errors in the graph-matching problem. This probability distribution is used to locate matches using MAP label updates. We compare the resulting graph-matching algorithm with that recently reported by Wilson and Hancock. The use of edit-distance offers an elegant alternative to the exhaustive compilation of label dictionaries. Moreover, the method is polynomial rather than exponential in its worst-case complexity. We support our approach with an experimental study on synthetic data and illustrate its effectiveness on an uncalibrated stereo correspondence problem. This demonstrates experimentally that the gain in efficiency is not at the expense of quality of match

Post-acute COVID-19 neuropsychiatric symptoms are not associated with ongoing nervous system injury

A proportion of patients infected with severe acute respiratory syndrome coronavirus 2 experience a range of neuropsychiatric symptoms months after infection, including cognitive deficits, depression and anxiety. The mechanisms underpinning such symptoms remain elusive. Recent research has demonstrated that nervous system injury can occur during COVID-19. Whether ongoing neural injury in the months after COVID-19 accounts for the ongoing or emergent neuropsychiatric symptoms is unclear. Within a large prospective cohort study of adult survivors who were hospitalized for severe acute respiratory syndrome coronavirus 2 infection, we analysed plasma markers of nervous system injury and astrocytic activation, measured 6 months post-infection: neurofilament light, glial fibrillary acidic protein and total tau protein. We assessed whether these markers were associated with the severity of the acute COVID-19 illness and with post-acute neuropsychiatric symptoms (as measured by the Patient Health Questionnaire for depression, the General Anxiety Disorder assessment for anxiety, the Montreal Cognitive Assessment for objective cognitive deficit and the cognitive items of the Patient Symptom Questionnaire for subjective cognitive deficit) at 6 months and 1 year post-hospital discharge from COVID-19. No robust associations were found between markers of nervous system injury and severity of acute COVID-19 (except for an association of small effect size between duration of admission and neurofilament light) nor with post-acute neuropsychiatric symptoms. These results suggest that ongoing neuropsychiatric symptoms are not due to ongoing neural injury

Accelarated immune ageing is associated with COVID-19 disease severity

Background The striking increase in COVID-19 severity in older adults provides a clear example of immunesenescence, the age-related remodelling of the immune system. To better characterise the association between convalescent immunesenescence and acute disease severity, we determined the immune phenotype of COVID-19 survivors and non-infected controls. Results We performed detailed immune phenotyping of peripheral blood mononuclear cells isolated from 103 COVID-19 survivors 3–5 months post recovery who were classified as having had severe (n = 56; age 53.12 ± 11.30 years), moderate (n = 32; age 52.28 ± 11.43 years) or mild (n = 15; age 49.67 ± 7.30 years) disease and compared with age and sex-matched healthy adults (n = 59; age 50.49 ± 10.68 years). We assessed a broad range of immune cell phenotypes to generate a composite score, IMM-AGE, to determine the degree of immune senescence. We found increased immunesenescence features in severe COVID-19 survivors compared to controls including: a reduced frequency and number of naïve CD4 and CD8 T cells (p < 0.0001); increased frequency of EMRA CD4 (p < 0.003) and CD8 T cells (p < 0.001); a higher frequency (p < 0.0001) and absolute numbers (p < 0.001) of CD28−ve CD57+ve senescent CD4 and CD8 T cells; higher frequency (p < 0.003) and absolute numbers (p < 0.02) of PD-1 expressing exhausted CD8 T cells; a two-fold increase in Th17 polarisation (p < 0.0001); higher frequency of memory B cells (p < 0.001) and increased frequency (p < 0.0001) and numbers (p < 0.001) of CD57+ve senescent NK cells. As a result, the IMM-AGE score was significantly higher in severe COVID-19 survivors than in controls (p < 0.001). Few differences were seen for those with moderate disease and none for mild disease. Regression analysis revealed the only pre-existing variable influencing the IMM-AGE score was South Asian ethnicity ( = 0.174, p = 0.043), with a major influence being disease severity ( = 0.188, p = 0.01). Conclusions Our analyses reveal a state of enhanced immune ageing in survivors of severe COVID-19 and suggest this could be related to SARS-Cov-2 infection. Our data support the rationale for trials of anti-immune ageing interventions for improving clinical outcomes in these patients with severe disease